A New Formulation for the Capacitated Lot Sizing Problem with Batch Ordering Allowing Shortages
نویسندگان
چکیده
منابع مشابه
Formulation and Solution ofTwo-Level Capacitated Lot-Sizing Problem
The integration of sequencing decisions in lot-sizing and scheduling problems has received an increased attention from the research community due to its inherent applicability to the real-world problems. In this paper, we develop and solve a synchronized and integrated two-level lot-sizing and scheduling problem motivated by a real-world problem arisen in the soft drink production. The soft dri...
متن کاملCapacitated Lot-sizing Problem with Setup Times, Stock and Demand Shortages
We address a multi-item capacitated lot-sizing problem with setup times, stock and demand shortages. Demand cannot be backlogged, but can be totally or partially lost. Safety stock is an objective to reach rather than an industrial constraint to respect. In this paper we consider an approach based on a lagrangean relaxation of the capacity constraints to generate a lower bound of the optimal va...
متن کاملA mixed-integer programming formulation for the general capacitated lot-sizing problem
A new mixed-integer programming (MIP) formulation is presented for the production planning of single-stage multi-product processes. The problem is formulated as a multi-item capacitated lot-sizing problem in which (a) multiple items can be produced in each planning period, (b) sequence-independent set-ups can carry over from previous periods, (c) set-ups can cross over planning period boundarie...
متن کاملA Capacitated Lot Sizing Problem with Stochastic Setup Times
In this paper, we study a Capacitated Lot Sizing Problem with Stochastic Setup Times (CLSP-SST).We describe a mathematical model that considers both regular costs (including production, setup and inventory holding costs) and expected overtime costs (related to the excess usage of capacity). The CLSP-SST is formulated as a two-stage stochastic programming problem. A procedure is proposed to effe...
متن کاملParallel Genetic Algorithm for the Capacitated Lot-Sizing Problem
A parallel genetic algorithm is presented to solve the well-known ca-pacitated lot-sizing problem. The approach is implemented on a massively parallel single instruction multiple data architecture with 16384 4-bit processors. Based on a random keys representation a schedule is backward oriented obtained which enables us to apply a very simple capacity check. Genetic algorithms are a general pur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2020
ISSN: 2227-7390
DOI: 10.3390/math8060878